package a10_动态规划;

/**
 * <p>
 * a07_不同路径2复习1
 * </p>
 *
 * @author flyduck
 * @since 2025/2/9
 */
public class a07_不同路径2复习1 {
    public static void main(String[] args) {
        int[][] obstacleGrid = new int[][]{{0,1},{0,0}};
        int i = uniquePathsWithObstacles(obstacleGrid);
        System.out.println();
    }
    public static int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if(obstacleGrid[0][0] == 1){
            return 0;
        }

        int m = obstacleGrid.length;
        int n = obstacleGrid[0].length;
        int[][] dp = new int[m][n];
        //初始化
        dp[0][0] = 1;
        for (int i = 1; i < m; i++) {
            if(obstacleGrid[i][0] == 1){
                break;
            }
            dp[i][0] = 1;
        }

        for (int j = 1; j < n; j++) {
            if(obstacleGrid[0][j] == 1){
                break;
            }
            dp[0][j] = 1;
        }

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if(obstacleGrid[i][j] == 1){
                    dp[i][j] = 0;
                }else {
                    dp[i][j] = dp[i-1][j] + dp[i][j-1];
                }

            }
        }
        return dp[m-1][n-1];

        //
        //dp[1][1] dp[1][2] dp[1][n-1]
        //dp[2][1] dp[2][2] dp[2][n-1]
        //dp[m-1][1] dp[m-1][2] dp[m-1][n-1]
    }
}
